Guaranteed intersection-free polygon morphing
نویسندگان
چکیده
منابع مشابه
Guaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کاملIntersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar graphs. Our algorithm uses a combination of different techniques to achieve smooth transformations: rigid morphing, compatible triangulations, as well as morphing based on interpolation of the convex repr...
متن کاملPolygon Morphing A Solution to the Vertex Correspondence Problem in 2D Polygon Morphing
This thesis deals with an approach, based on human perception to solve the vertex correspondence problem in two dimensional polygon morphing. Correspondences are established between points of high curvature and their local neighborhood in both source and target shape. To compare local neighborhoods, several criteria are introduced which compose a cost function, assigning costs depending on the ...
متن کاملConvex Polygon Intersection Graphs
Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...
متن کاملPolygon Morphing Using a M ultiresolution Representation
We present an algorithm for morphing between two simple polygons . The two polygons are converted to mul tiresolu tion representations. Intermediate representations are generated from these two, from which intermediate polygons are reconstructed. Our algorit.hm is simpler than the few existing polygon morphing schemes, and its results compare favorably. The key to the success of our algorithm i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 2001
ISSN: 0097-8493
DOI: 10.1016/s0097-8493(00)00108-4